Electricity markets with flexible consumption as nonatomic congestion games

نویسندگان

  • Q. Louveaux
  • S. Mathieu
چکیده

This article studies nonatomic congestion games with symmetric players sending flow in arcs linking a unique source and destination. These games can represent systems where electricity retailers controlling flexible consumption minimize their energy costs. We focus on games with affine cost functions and define laminar Nash equilibrium where the constraints on the minimum and maximal flow that a player must send in a given arc are not binding. We show that the flow sent by a player at a laminar Nash equilibrium does not depend on the demand of other players. In laminar flow, we bound the price of anarchy and the ratio between the maximum and the minimum arc cost. Finally, we propose a simple method based on the property of a laminar Nash equilibrium to compute the price of flexibility to which energy flexibility should be remunerated in electric power systems.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Congestion Management in Electricity Markets Using Demand Response Programs and Series FACTS Devices

In today’s restructured environment, congestion management plays an essential role in power system operation. Different methods are presented and discussed in this respect for congestion management in short-term and long-term intervals. It is attempted in the present paper to investigate the impact mechanism of FACTS devices and demand response programs together with generation re-dispatch as s...

متن کامل

The Impact of Collusion on the Price of Anarchy in Nonatomic and Discrete Network Games

Hayrapetyan, Tardos andWexler recently introduced a framework to study the impact of collusion in congestion games on the quality of Nash equilibria. We adopt their framework to network games and focus on the well established price of anarchy as a measure of this impact. We rst investigate nonatomic network games with coalitions. For this setting, we prove upper bounds on the price of anarchy f...

متن کامل

Weighted Congestion Games: Price of Anarchy, Universal Worst-Case Examples, and Tightness

We characterize the price of anarchy in weighted congestion games, as a function of the allowable resource cost functions. Our results provide as thorough an understanding of this quantity as is already known for nonatomic and unweighted congestion games, and take the form of universal (cost function-independent) worst-case examples. One noteworthy byproduct of our proofs is the fact that weigh...

متن کامل

X Weighted Congestion Games: The Price of Anarchy, Universal Worst-Case Examples, and Tightness

We characterize the price of anarchy (POA) in weighted congestion games, as a function of the allowable resource cost functions. Our results provide as thorough an understanding of this quantity as is already known for nonatomic and unweighted congestion games, and take the form of universal (cost function-independent) worst-case examples. One noteworthy byproduct of our proofs is the fact that...

متن کامل

Bounding the inefficiency of equilibria in nonatomic congestion games

Equilibria in noncooperative games are typically inefficient, as illustrated by the Prisoner’s Dilemma. In this paper, we quantify this inefficiency by comparing the payoffs of equilibria to the payoffs of a “best possible” outcome. We study a nonatomic version of the congestion games defined by Rosenthal [15], and identify games in which equilibria are approximately optimal in the sense that n...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2015